A simple algorithm for computing canonical forms
نویسندگان
چکیده
منابع مشابه
A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملComputing codimensions and generic canonical forms for generalized matrix products
A generalized matrix product can be formally written as A sp p A sp−1 p−1 · · ·A s2 2 A s1 1 , where si ∈ {−1,+1} and (A1, . . . , Ap) is a tuple of (possibly rectangular) matrices of suitable dimensions. The periodic eigenvalue problem related to such a product represents a nontrivial extension of generalized eigenvalue and singular value problems. While the classification of generalized matri...
متن کاملComputing unique canonical covers for simple FDs via transitive reduction
Although there is a rich body of research on dependency theory, only few results concerning simple functional dependencies (FDs) have been published. In this paper, the following key results regarding simple FDs are shown. First, given an acyclic set F of simple FDs there exists exactly one canonical cover for F . Second, this uniquely determined canonical cover can be computed via transitive r...
متن کاملAn algorithm for computing simple k-factors
Abstract A k-factor of graph G is defined as a k-regular spanning subgraph of G. For instance, a 2-factor of G is a set of cycles that span G. 2-factors have multiple applications in Graph Theory, Computer Graphics, and Computational Geometry [5, 4, 6, 11]. We define a simple 2-factor as a 2-factor without degenerate cycles. In general, simple k-factors are defined as k-regular spanning subgrap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1984
ISSN: 0898-1221
DOI: 10.1016/0898-1221(84)90059-2